Backward Versus Forward Anaphora: Reconstruction in Child Grammar

نویسندگان

  • Maria Teresa Guasti
  • Gennaro Chierchia
چکیده

Various cases of backward and forward anaphora are studied in a number of seemingly unrelated constructions and argued to be a manifestation of a unitary principle, namely Principle C of the Binding Theory (Chomsky, 1981; 1986). We point out an unexpected restriction on (forward) anaphora that is argued to be a case in which Principle C operates at the “reconstructed” level. Italian-speaking children manifest an early mastery of these constructions (age 3;10). Contrary to what several proposals may lead one to expect, the ability to correctly judge instances of forward anaphora and the ability to correctly judge instances of backward anaphora manifest themselves simultaneously. These results on one hand provide evidence in favor of a biologically determined mechanism subsuming both standard Principle C effects and cases of “reconstruction.” On the other hand, they support the view that certain cases of movement are, as they were, automatically “undone” when anaphoric dependencies are computed, as predicted by recent theories of movement as copying.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on backward anaphora

In this paper I present four empirical observations about backward anaphora; building on Schlenker (2005), I suggest that the phenomenon should be though of in terms of a left–to–right interpretation process, in which discourse referents can be dynamically stored (by NPs) and retrieved (by pronouns) at two distinct and interacting levels of organization of the grammar: the «local» level of sema...

متن کامل

Improvement of Forward-Backward Pursuit Algorithm Based on Weak Selection

Forward-backward pursuit (FBP) algorithm is a novel two-stage greedy approach. However once its forward and backward steps were determined during iteration, it would make computing time increased and affected the reconstruction efficiency. This paper presents a algorithm called forward-backward pursuit algorithm based on weak selection (SWFBP) by introducing threshold strategy into FBP algorith...

متن کامل

Fourier-based forward and back projectors for iterative tomographic image reconstruction

Forward projectors are needed for iterative image reconstruction algorithms for CT or PET image reconstruction. The major cost of iterative reconstruction algorithms is computing the forward and backward projections. Conventionally, this is done in the image domain as computing the lengths of intersections between each X-ray ray and each image voxel. These operations are the major computational...

متن کامل

The Embodiment of Success and Failure as Forward versus Backward Movements

People often speak of success (e.g., "advance") and failure (e.g., "setback") as if they were forward versus backward movements through space. Two experiments sought to examine whether grounded associations of this type influence motor behavior. In Experiment 1, participants categorized success versus failure words by moving a joystick forward or backward. Failure categorizations were faster wh...

متن کامل

Forward and Backward Uncertainty Quantification in Optimization

This contribution gathers some of the ingredients presented during the Iranian Operational Research community gathering in Babolsar in 2019.It is a collection of several previous publications on how to set up an uncertainty quantification (UQ) cascade with ingredients of growing computational complexity for both forward and reverse uncertainty propagation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013